Degree Sequences and Dominating Cycles in 2-Connected Graphs
نویسندگان
چکیده
منابع مشابه
Vertex-dominating cycles in 2-connected bipartite graphs
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 13 (|V (G)| − 4), then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V1 and V2 such that δ(G) ≥ 1 3 (max{|V1|, |V2|}+ 1), then G has a vertex-dominating cycle.
متن کاملA note on dominating cycles in 2-connected graphs
Let G be a 2-connected graph on n vertices such that d(x)+ d(y)+ d(z)>/n for all triples of independent vertices x,y,z. We prove that every longest cycle in G is a dominating cycle unless G is a spanning subgraph of a graph belonging to one of four easily specified classes of graphs.
متن کاملConnected dominating set in graphs without long paths and cycles
The ratio of the connected domination number, γc, and the domination number, γ, is strictly bounded from above by 3. It was shown by Zverovich that for every connected (P5, C5)-free graph, γc = γ. In this paper, we investigate the interdependence of γ and γc in the class of (Pk, Ck)-free graphs, for k ≥ 6. We prove that for every connected (P6, C6)-free graph, γc ≤ γ+1 holds, and there is a fam...
متن کاملCycles in 2-connected graphs
Let Gn be a class of graphs on n vertices. For an integer c, let ex(Gn, c) be the smallest integer such that if G is a graph in Gn with more than ex(Gn, c) edges, then G contains a cycle of length more than c. A classical result of Erdös and Gallai is that if Gn is the class of all simple graphs on n vertices, then ex(Gn, c) = c 2 (n − 1). The result is best possible when n − 1 is divisible by ...
متن کامل2-connected Graphs with Small 2-connected Dominating Sets
Let G be a 2-connected graph. A subset D of V (G) is a 2-connected dominating set if every vertex of G has a neighbor in D and D induces a 2-connected subgraph. Let γ2(G) denote the minimum size of a 2-connected dominating set of G. Let δ(G) be the minimum degree of G. For an n-vertex graph G, we prove that γ2(G) ≤ n ln δ(G) δ(G) (1 + oδ(1)) where oδ(1) denotes a function that tends to 0 as δ →...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems of Computer Science
سال: 2018
ISSN: 2579-2784
DOI: 10.51408/1963-0004